Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding

This paper reduces multiple-unicast network coding to single-unicast secure network coding and single-unicast network error correction. Specifically, we present reductions that map an arbitrary multiple-unicast network coding instance to a unicast secure network coding instance in which at most one link is eavesdropped, or a unicast network error correction instance in which at most one link is...

متن کامل

Network Coding for Resource Redistribution in a Unicast Network

In this paper, we explore the use of network coding as method for redistributing resources to achieve capacity in twouser unicast networks. We introduce a simple network example, which we call the extended butterfly network, whose structure illustrates the idea of resource swapping, and demonstrates possible issues related to user incentives for network coding. We show that for such a network, ...

متن کامل

Network Coding: The Case of Multiple Unicast Sessions

In this paper, we investigate the benefit of network coding over routing for multiple independent unicast transmissions. We compare the maximum achievable throughput with network coding and that with routing only. We show that the result depends crucially on the network model. In directed networks, or in undirected networks with integral routing requirement, network coding may outperform routin...

متن کامل

Network Coding, Algebraic Coding, and Network Error Correction

This paper discusses the relation between network coding, (classical) algebraic coding, and network error correction. In the first part, we clarify the relation between network coding and algebraic coding. By showing that the Singleton bound in algebraic coding theory is a special case of the Maxflow Min-cut bound in network coding theory, we formally establish that linear multicast and its str...

متن کامل

An Efficient Retransmission Based on Network Coding with Unicast Flows

Recently, network coding technique has emerged as a promising approach that supports reliable transmission over wireless loss channels. In existing protocols where users have no interest in considering the encoded packets they had over coding or decoding operations, this rule is inefficient and expensive. This paper studies the impact of encoded packets in the reliable unicast network coding vi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2018

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2018.2820686